Quantifying the impact of non-adherence to drug therapy: a technical note concerning an application of a branch and bound algorithm.

نویسندگان

  • Daniel Smith
  • Christina Pagel
  • Martin Utley
  • Steve Gallivan
چکیده

Pharmacokinetic models typically rely on a key assumption that patients take their medication as prescribed, whereas this is often not the case. We present a branch and bound algorithm that can be used to estimate the time-varying probability that, given a specified pattern of nonadherence to a prescribed regimen, a patient receives no therapeutic benefit from treatment. Use of this algorithm is a much faster method for obtaining this probability than exhaustive computation of the relevant probability distribution. The use of this algorithm to assess, in quantitative terms, the impact of non-adherence on the effectiveness of treatment provides a rational basis for evaluating the potential harm to patients.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)

One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...

متن کامل

Pareto Optimization of a Two-degree of Freedom Passive Linear Suspension Using a New Multi-objective Genetic Algorithm (TECHNICAL NOTE)

The primary function of a suspension system of a vehicle is to isolate the road excitations experienced by the tires from being transmitted to the passengers. In this paper, we formulate an optimal vehicle suspension design problem with the quarter-car vehicle dynamic model. A new multi-objective genetic algorithm is used for Pareto optimization of a two-degree of freedom vehicle vibration mode...

متن کامل

Single Array and Bound Method (RESEARCH NOTE).

One of the major disadvantages of using Branch and Bound algorithm to solve permutation bases problems by computer is the size of main memory required. The single Array Branch and Bound (SABB) method introduction here aims to overcome this deficiency, using only N memory locations as a vector of size N, and a single cell C with N bits.

متن کامل

Enumeration of Dominant Solutions: An Application in Transport Network Design

A One-Dimensional Binary Integer Programming Problem (1DB-IPP) is concerned with selecting a subset from a set of k items in budget constraint to optimize an objective function. In this problem a dominant solution is defined as a feasible selection to which no further item could be added in budget constraint. This paper presents a simple algorithm for Enumeration of Dominant Solutions (EDS) and...

متن کامل

Comparing the effectiveness of treatment based on acceptance and commitment and mindfulness therapy on adherence to treatment in People with drug addiction

The purpose of the present study was to compare the effectiveness of acceptance and commitment-based therapy and mindfulness-based therapy on adherence to treatment in People with drug addiction. The research method was semi-experimental with a pre-test-post-test design and a control group with a one-month follow-up. The statistical population included People with drug addiction who visited the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Health care management science

دوره 11 3  شماره 

صفحات  -

تاریخ انتشار 2008